Computing Data Cubes and Aggregate Query Processing
نویسنده
چکیده
The paper is dealing with data cubes, multidimensional data structures built from data warehouse for OLAP purposes. Performing aggregations over cube dimensions and the way they are stored is considered to be a problem worth optimization. A two-tier multilevel list structure for storing cubes has been proposed. Algorithms for tiers’ setup and maintenance when records are loaded into the data warehouse have been designed. An overview of analytical queries has been presented. Algorithm for processing analytical query over data cubes stored in the proposed structure has been outlined.
منابع مشابه
The Iterative Data Cube
Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-they can result in non-interactive response times (e.g. in the order of minutes). To speed up range queries, value...
متن کاملWOLAP: Wavelet-Based Range Aggregate Query Processing
The Discrete Wavelet Transform has emerged as an elegant tool for data analysis queries. It was not until the time we proposed a new wavelet technique, ProPolyne, for fast exact, approximate, or progressive polynomial aggregate query processing that data did not have to be compressed, unlike most of the prior studies in this area. In this paper, after reviewing our ProPolyne technique in more d...
متن کاملOptimization of Percentage Cube Queries
OLAP cubes are a powerful database technology to join tables and aggregate data to discover interesting trends. However, OLAP cubes exhibit limitations to uncover fractional relationships on a measure aggregated at multiple granularity levels. One prominent example is the percentage, an intuitive probablistic metric, used in practically every analytic application. With such motivation in mind, ...
متن کاملA Parallel and Distributed Method for Computing High Dimensional MOLAP
Data cube has been playing an essential role in fast OLAP(on-line analytical processing) in many multidimensional data warehouse. We often execute range queries on aggregate cube computed by pre-aggregate technique in MOLAP. For the cube with d dimensions, it can generate 2 cuboids. But in a high-dimensional data warehouse (such as the applications of bioinformatics and statistical analysis, et...
متن کاملSmall Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
Small Materialized Aggregates (SMAs for short) are considered a highly flexible and versatile alternative for materialized data cubes. The basic idea is to compute many aggregate values for small to medium-sized buckets of tuples. These aggregates are then used to speed up query processing. We present the general idea and present an application of SMAs to the TPC-D benchmark. We show that explo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005